Attaching Efficient Executability to Partial Functions in ACL2
نویسنده
چکیده
We describe a macro called defpun-exec to attach executable bodies to partial functions in ACL2. The macro makes use of two features mbe and defexec introduced in ACL2 from version 2.8, that afford a clean separation of execution efficiency from logical elegance.
منابع مشابه
A Step-Indexing Approach to Partial Functions
We describe an ACL2 package for defining partial recursive functions that also supports efficient execution. While packages for defining partial recursive functions already exist for other theorem provers, they often require inductive definitions or recursion operators which are not available in ACL2 and they provide little, if any, support for executing the resulting definitions. We use stepin...
متن کاملObtaining an ACL2 Specification from an Isabelle/HOL Theory
In this work, we present an interoperability framework that enables the translation of specifications (signature of functions and lemma statements) among different theorem provers. This translation is based on a new intermediate XML language, called XLL, and is performed almost automatically. As a case study, we focus on porting developments from Isabelle/HOL to ACL2. In particular, we study th...
متن کاملSingle-Threaded Objects in ACL2
ACL2 is a rst-order applicative programming language based on Common Lisp. It is also a mathematical logic for which a mechanical theorem-prover has been implemented in the style of the Boyer-Moore theorem prover. The ACL2 system is used primarily in the modeling and veriica-tion of computer hardware and software, where the executability of the language allows models to be used as prototype des...
متن کاملGeneric Theories as Proof Strategies: A Case Study for Weakest Precondition Style Proofs
This paper presents several techniques, motivated by the study of weakest preconditions, for structuring proofs about recursive functions using generic theories. The theories can be implemented on a variety of theorem provers that support introduction and instantiation of partial functions (PVS, HOL, ACL2, NQTHM). The focus here is on the Boyer-Moore (NQTHM [1,2]) and Kaufmann-Moore (ACL2 [6]) ...
متن کاملIvy : a Preprocessor and Proofchecker for First - Order
This case study shows how non-ACL2 programs can be combined with ACL2 functions in such a way that useful properties can be proved about the composite programs. Nothing is proved about the non-ACL2 programs. Instead, the results of the non-ACL2 programs are checked at run time by ACL2 functions, and properties of these checker functions are proved. The application is resolution/paramodulation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004